Method and system for billing network access capacities shared between internet service providers

ABSTRACT

For optimizing Internet access resources, a method and system for billing network access capacities shared across Internet service providers is disclosed. A Client Service Provider (CSP) may rent access on Points Of Presence belonging to a Master Service Provider (MSP) while maintaining a constant security level and providing connection accounting. When a CSP&#39;s subscriber sends an access request to a MSP, the MSP analyzes the subscriber&#39;s realm and checks the capacities allocated to the subscriber&#39;s CSP. If connection is allowed, the MSP sends an authentication request to the CSP. If the subscriber is authenticated, the MSP launches an accounting process based on the subscriber&#39;s realm while the CSP may launch an accounting process associated with the subscriber identifier. The cost of rented Points Of Presence capacity is based on total connection time and on the number of simultaneous connections established by the MSP for the CSP, combined with predetermined thresholds.

FIELD OF THE INVENTION

The present invention relates generally to the accessing of distributed computing network environments and more specifically to a method and system for billing Internet network access points shared between independent Internet Service Providers.

BACKGROUND OF THE INVENTION

Recently, communications between computer systems for data and information exchange has been significantly developing thanks to the Internet, which is known to have rapidly spread on a global level by virtue of being supported by public communications networks, both traditional and technologically advanced, such as ISDN, ADSL, GPRS, and others.

Success of this phenomenon is indeed due, also, to the availability, in real time and affordably, of information and data stored on servers located all over the globe and internetworked so that they are reachable through the various last mile network access services.

As regards the price of operations on the net, it has to be considered that it is directly bonded to the cost of the access connection from a user's computer to the access point into the net. The network access points are identified, for example by telephone numbers which are made available to the users by each Internet Service Provider (ISP), in order to allow the connection to the Provider's computers, which are part of the network. As it is known, their primary function is to support Internet access for their subscribers. For this, they maintain a subscribers database which stores all users' identification data. In addition, they typically offer value-added services such as electronic mail, access to sites of the net by assisted, or not, search procedures, storage space for user personal data, commercial news or other information news visible to all users of the net, and other services.

Thanks to these services' quality and diversity and also to a growing variety of end-user devices supporting access to the Internet, such as computers, advanced means interfacing TV sets, mobile telephone apparatuses, Personal Digital Assistants, etc., the number of Internet users has been increasing very rapidly. Therefore, the relevance is easily understandable of getting quickly connected to the net through affordable access points, that is points included in the user's telephone district or area, or in very near areas.

In order to better understand the difficulties that can be associated with the above, it has to be considered that, looking at the current connection modalities, the user has to choose a specific Internet Service Provider. The chosen ISP identifies the user through specific identification data. For the connection, the Internet Service Provider publishes a set of access numbers, for example telephone numbers, which point to the ISP's Points of Presence and can be stored in memory means of the user's apparatus connecting to the net. For connection cost minimization, it is important that an access number can be selected which coincides with the provider's access points nearest to the place where the connecting apparatus is located.

FIG. 1 illustrates schematically the accessing of data on Internet network 100, a distributed computing network environment. The participants in the Internet are a wide variety of machines, owned by a wide variety of organizations and individuals, all able to communicate and share information. For example, the Internet network 100 includes a plurality of Internet sites 105-1 to 105-q. These Internet sites are generally operated by corporations, universities, and governmental organizations. Each Internet site may include one or more repositories of information and resources that may be accessed over the Internet. Each Internet site e.g., 105-1 and 105-q, may include a plurality of WEB servers e.g., 110-1 to 110-r and 110′-1 to 110′-n, respectively. Each of these WEB servers may provide a “home page” to be visited, files to be read or downloaded, applications to be shared, and the like.

The Internet network 100 also includes multiple points of presence (POPs) 115-1 to 115-s that are operated by Internet Service Providers (ISPs). These ISPs are in the business of providing Internet access to end-user stations, generically referred to as 120. As mentioned above, the costs of the telephone connection between a user's computer and an access point to the net represent an important part of the Internet connection costs and thus, the geographical locations and distribution of the POPs 115-1 to 115-s are important. For sake of illustration, it is assumed that POPs 115-1 to 115-3 belong to a first geographical location, referred to as 125-1, and POP 115-s belongs to a second geographical location, referred to as 125-2.

As it is apparent from FIG. 1, two problems may arise when a user needs to set a connection with the ISP whom he has a supplying contract with. Firstly, if the POP of the ISP is located in the second geographical location 125-2 while the user is temporarily located in the first geographical location 125-1, the communication costs between the user and the point of presence will increase. Secondly, if the closest POP is saturated, the user wanting to nonetheless connect must select another POP, possibly in a different communications district, which would increase communication costs. For example, if POPs 115-3 and 115-s belong to the same ISP and the user is located in the first geographical location 125-1, he may be forced to set the connection with POP 115-s when POP 115-3 is saturated. This situation may arise even though POPs 115-1 and 115-2 do have capacity available since these POPs really belong to other ISPs.

Likewise, the subscribers of ISPs that have constrained access infrastructure capacity (low-density POPs distribution, limited Network Access Point capacity, etc.) may experience difficulties and sub-optimal costs when establishing connections.

While these problems may certainly be avoided by improving geographical distribution of POPs and increasing the number and capacity of POPs for each ISP, this may not be practical due to the required expenses and ISP investment potential realities. As a conclusion, there is a need for a method and system for sharing points of presence between Internet Service Providers wherein the use of these shared points of presence may be billed efficiently.

SUMMARY OF THE INVENTION

Thus, it is a broad object of the invention to remedy the shortcomings of the prior art as described above.

It is another object of the invention to provide a method and system for billing network access capacities shared between independent Internet Service Providers.

It is a further object of the invention to provide a method and system for billing network access capacities shared between Internet Service Providers wherein the billing is based upon the number and the duration of connections.

The accomplishment of these and other related objects is achieved by a method for determining a time period of sharing network access capacities between a Master Service Provider, comprising at least one Point Of Presence including at least one port, and a Client Service Provider, said time period of sharing network access capacities being determined according to at least one threshold representing a predetermined shared network access capacity amount and defining at least two ranges, a time period being associated with each of said ranges, said method comprising the steps of:

-   -   initializing the time period associated with each of said         ranges; and,     -   when a port of said at least one Point Of Access of said Master         Service Provider is used to establish a connection requested by         a subscriber of said Client Service Provider, comparing a number         of ports of said at least one Points Of Presence of said Master         Service Provider used by subscribers of said Client Service         Provider with said at least one threshold to determine the         corresponding range and storing a time at which said connection         is established in relation with said corresponding range;     -   when one port of said at least one Points Of Presence of said         Master Service Provider used by a subscriber of said Client         Service Provider is released,     -   determining a higher range to which a stored time is associated;     -   selecting one of the times stored in relation with said         determined range;     -   subtracting said selected time from the time at which said port         of said at least one Point Of Presence of said Master Service         Provider is released;     -   adding the result of said subtraction to the time period         associated with said determined range; and,     -   deleting said selected time.

Further advantages of the present invention will become apparent to the ones skilled in the art upon examination of the drawings and detailed description. It is intended that any additional advantages be incorporated herein.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates schematically the accessing of data on an Internet network, wherein the invention could be implemented.

FIG. 2 shows schematically the authentication, authorization, and accounting mechanism in the Master and Client Service Providers when access requests are received.

FIG. 3 illustrates an example of the algorithm used for establishing a connection between a subscriber and a Master Service Provider's point of presence.

FIG. 4 depicts schematically an implementation of the method for sharing points of presence when using the RADIUS protocol.

FIG. 5 illustrates an algorithm that may be used in the RADIUS proxy for sharing points of presence.

FIGS. 6 and 7 show timing analysis examples of a connection process based on the algorithm of FIG. 5.

FIG. 8 depicts the general billing principle when using three thresholds θ₁, θ₂ and θ₃.

FIG. 9 , comprising tables a, b and c, illustrates the general principle shown on FIG. 8.

FIG. 10 , comprising FIGS. 10 a and 10 b, shows an example of the connection table and the threshold table that are used for billing CSPs.

FIG. 11 illustrates an example of the algorithm used for dynamically updating the connection and threshold tables in the MSP when a new connection is established.

FIG. 12 shows the principle on which the computation of billing time is based.

FIG. 13 illustrates an example of the algorithm used for dynamically updating the connection and threshold tables in the MSP when a connection is stopped.

DETAILED DESCRIPTION OF THE INVENTION

According to the invention, a Service Provider, typically an Internet Service Provider (ISP) or Application Service Provider (ASP), referred to as “Master SP” or MSP in the following description, owning a large infrastructure, could rent out part of its network access capacity to a third party service provider, referred to as “Client SP” or CSP, having its own infrastructure, that requires additional capacity at peak times or needs to increase, geographical coverage through additional Points Of Presence (POP). To maintain a constant security level and provide connection billing basis, sharing of points of presence is based on the following items:

-   -   the Master SP identifies incoming access requests into its         network which are really meant for the Client SP in order to         route the session appropriately;     -   the master SP sends a request to the Client SP to check         authorization of Client SP's subscribers upon incoming access         requests of these Client SP's subscribers (information of Client         SP's subscribers are not stored in the Master SP databases)     -   the Master SP tracks sessions coming in through its POP's and         meant for the Client SP in order to bill the Client SP based on         actual usage.     -   the Master SP controls in real-time the capacity allocated to         its Client SP's to prevent impact on the quality of the service         offered to its own subscribers;     -   the Client SP retains the same level of control and ownership on         its subscribers' sessions whether they come in through its own         or through the Master SP POP.

The main principle of sharing points of presence consists in the creation of a “Virtual Subscriber” that represents Client SPs in the Master SP system, as illustrated on FIG. 2. FIG. 2 illustrates schematically the Authentication, Authorization, and Accounting mechanism (AAA) in the Master and Client SPs when access requests are received. Master SP 200 comprises a POP 205, an AAA mechanism 210, a database 215 containing information about its subscribers, and a database 220 for virtual subscribers i.e., Client SPs. Likewise, Client SP 225 comprises a POP 230, an AAA mechanism 235, and a database 240 containing information about its subscribers. A standard Client SP does not contain a database for virtual subscribers. However, it must be noticed that a SP may be simultaneously a Master and a Client SP. In such case, the Client/Master SP contains a database for virtual subscribers, i.e., Client SPs of the Client/Master SP.

When a Master SP's subscriber 245-1 requests an access to Master SP 200 through POP 205 or when a Client SP's subscriber 245-2 requests an access to Client SP 225 through POP 230, AAA mechanisms are used as standard. In such a case, the POP send a request to the AAA module that compares subscriber information e.g., subscriber identifier and password, with the one stored in the subscriber database. If information matches, the connection is established. Else, the connection is rejected.

FIG. 3 illustrates an example of the algorithm used for establishing a connection between a subscriber 245-1 or 245-2 and a POP of the Master SP's 200. When the Master SP 200 receives an access request, a first test is performed to determine if it comes from a Master SP's subscriber (step 300), using the database 215 of Master SP's subscribers. If the access request comes from a Master SP's subscriber, the connection is established (step 325) after this subscriber has been authenticated and authorized. This authentication/authorization is a standard authentication/authorization process, e.g., verifying the password associated with the subscriber identifier using the database 215. If the access request does not come from a subscriber of the Master SP, a test is performed to determine whether or not it comes from a subscriber of a Client SP (step 305). This test is done by using the database 220 of the virtual CSPs, by analyzing the subscriber's realm (Master SP does not store information relative to Client SP's subscribers). If the realm of the subscriber does not correspond to any Client SP, the access request is rejected. Else, a new test is performed to determine whether or not a subscriber of the corresponding Client SP can be allowed to establish a connection from the Master SP (step 310). This test, based on the Virtual SP's status, consists in checking access capacities allocated to Client SP 225, e.g., are there enough free ports for the CSP, has the CSP not exceeded its credit threshold, has the MSP not suspended business with CSP? Such Virtual SP's status is stored in database 220. If a connection is not allowed for reasons related to the Client SP, the access request is rejected.

Else, if connection is allowed, another test is performed to authenticate the subscriber and determine if Client SP authorizes the connection (step 315). To that end, the Master SP sends a request to the Client SP with the information received in the subscriber's request, e.g., subscriber identifier and password. As mentioned above, information relative to Client SP's subscriber is not stored in any Master SP database and thus, the Master SP can not authenticate Client SP's subscribers. Using its database 240, the Client SP authenticates the subscriber having sent the access request to the Master SP and notifies the Master SP of the result, success or failure, of the authentication. Such authentication process is standard. If the subscriber is not authenticated, the connection is rejected. Else, connection parameters are stored in the database 220 of the virtual SP (step 320) and the connection is established (step 325).

Even though Client SP is identified using the realm of the subscriber having sent the request in the previous description, other means may be used such as using the called-number or the name of the network access server when a called-number or a network access server are allocated to the connection of Client SP's subscribers.

The implementation of sharing points of presence capabilities may be based on the RADIUS protocol, by creating a RADIUS proxy between the Master SP POP, containing the RADIUS Client, and the Master SP RADIUS server and Client SP RADIUS server, as illustrated on FIG. 4. The RADIUS protocol is described, for example, in “Remote Authentication Dial In User Service (RADIUS)” (Rigney, C., Willens, S., Rubens, A. and W. Simpson, RFC 2865, June 2000) and “RADIUS Accounting” (Rigney, C., RFC 2866, June 2000).

Turning now to FIG. 4, which illustrates schematically the implementation of sharing points of presence capabilities when using RADIUS protocol, there is shown the Master and Client SPs 200 and 225 as well as MSP and CSP subscribers 245-1 and 245-2 of FIG. 2. Master SP 200 comprises the POP 205 that includes a set of Network Access Servers (NAS), generically referred to as 400. Each NAS 400 controls a plurality of modems (not represented for sake of clarity) that interface subscriber systems to Master SP 200. In this implementation example, each NAS 400 comprises a RADIUS client, generically referred to as 405, to handle subscriber's requests. A RADIUS proxy 410 links RADIUS clients 405 to a Master RADIUS server 415 and a Client RADIUS server 430. RADIUS proxy 410 determines which RADIUS server must be accessed. Likewise, Client SP 225 comprises the POP 230 that includes a set of NAS, generically referred to as 420, that interface subscriber systems to Client SP 225. Again for illustration purposes, each NAS 420 includes a RADIUS client, generically referred to as 425. Client RADIUS server 430 may be accessed either by RADIUS clients 425 or RADIUS proxy 410.

FIG. 5 depicts an algorithm that may be implemented in RADIUS proxy 410. When an access request is received from a RADIUS client 405, a first test is performed to determine whether or not the request is received from a Master SP's subscriber (step 500). If the request has been sent by a Master SP's subscriber, the request is transmitted to the Master RADIUS server 415 (step 505). Upon reception of an authentication acknowledgment from the Master RADIUS server (step 510), a second test is performed to determine whether or not the subscriber has been authenticated (step 515). If the subscriber has not been authenticated, the access request is rejected, else another test is conducted to determine if the subscriber is a Master SP's subscriber or not (step 520). If the subscriber is a Master SP's subscriber, the connection is established and accounting may start (step 525).

If the access request has not been sent by a Master SP's subscriber (step 500), the access request is copied and modified (step 530). The modification of the access request comprises the step of removing the subscriber identifier and password that are replaced by a virtual subscriber identifier and password. A virtual subscriber identifier and password are assigned to each Client SP of the Master SP 200, based on the realm. Then, the modified access request is transmitted to the Master RADIUS server 415 (step 535). Upon reception of an authentication acknowledgement from the Master RADIUS server (step 510), the second test is performed as described previously to determine whether or not the (virtual) subscriber, representing the CSP, has been authenticated (step 515). If the (virtual) subscriber has not been authenticated, the access request is rejected. Else, the other test is conducted to determine if the subscriber is a Master SP's subscriber or not (step 520). If the subscriber is not a Master SP's subscriber, the original access request is transmitted to Client RADIUS server 430 within the CSP for subscriber authentication purposes (step 540). Upon reception of an authentication acknowledgement from the Client RADIUS server (step 545), a test is performed to determine whether or not the subscriber is authenticated (step 550). If the subscriber is not authenticated, the access request is rejected. In such a case, the virtual subscriber identifier and password are replaced by the real ones before the reject access message is transmitted to the NAS. Else, if the subscriber is authenticated, the connection is established and accounting, e.g., connection duration and number of connections established for corresponding Client SP, may start (step 525).

As mentioned above, determining if a subscriber is a Master SP′ subscriber or a Client SP's subscriber may be based on subscriber's realm or any equivalent information.

FIGS. 6 and 7 illustrate timing analysis examples of a connection process based on the algorithm described by reference to FIG. 5.

FIG. 6 depicts a first connection example concerning a Master SP's subscriber, where accounting data related to the connection is collected for billing of the subscriber. When receiving the access request from the subscriber, the NAS transmits the access request with the subscriber identifier (comprising a name and the Master's realm) and the password to the RADIUS proxy. After having determined that the access request has been sent by a Master SP's subscriber, the RADIUS proxy transmits this access request comprising a subscriber identifier and password to the Master RADIUS server for authenticating the subscriber. If the Master RADIUS server authenticates the subscriber, an access accept message is transmitted back to the RADIUS proxy. Upon reception of the access accept message, the RADIUS proxy forwards this access accept message to the NAS. Then, the NAS sends an accounting start request with the subscriber and session identifiers to the RADIUS proxy. After having determined that accounting request concerns a Master SP's subscriber, the RADIUS proxy transmits this request with the subscriber and session identifiers to the Master RADIUS server. The Master RADIUS server launches an accounting process associated with this subscriber and sends back an accounting start acknowledge message comprising the subscriber and session identifiers to the RADIUS proxy. This accounting start acknowledge message comprising the subscriber and session identifiers is then transmitted to the NAS.

FIG. 7 illustrates a second connection example concerning a Client SP's subscriber when a connection is established (accepted by both Master and Client SPs) and accounted for billing the Client SP and the subscriber. When receiving the access request from the subscriber, the NAS transmits the access request with the subscriber identifier (comprising a name and a realm) and the password to the RADIUS proxy. The RADIUS proxy copies the access request and modifies it to replace the subscriber identifier and password by a virtual subscriber identifier and password associated with the subscriber's realm. If there are a virtual subscriber identifier and password associated with the subscriber's realm, which is the case in this example, the modified access request is then transmitted to the Master RADIUS server. The Master RADIUS server checks access capacities allocated with Client SP. If the Client SP is allowed to create a new connection, the Master RADIUS server sends back an access accept message, comprising the virtual subscriber identifier, to the RADIUS proxy. The RADIUS proxy then transmits the original access request with the subscriber identifier and password to the Client RADIUS server. If the Client RADIUS server authenticates the subscriber, an access accept message comprising the subscriber identifier is transmitted back to the RADIUS proxy. The RADIUS proxy sends this access accept message comprising the subscriber identifier to the NAS that sends an accounting start message comprising the subscriber and session identifiers to the RADIUS proxy. The RADIUS proxy copies the accounting start message and modifies it to replace the subscriber identifier by a virtual subscriber identifier associated with the subscriber's realm. The modified accounting start message is then transmitted to the Master RADIUS server. The Master RADIUS server launches the accounting process corresponding to the Client SP associated with the subscriber and sends back an accounting start acknowledge message comprising the virtual subscriber and session identifiers to the RADIUS proxy. The RADIUS proxy then transmits the original accounting start message with the subscriber and session identifiers to the Client RADIUS server. The Client RADIUS server launches the accounting process corresponding to the subscriber and sends back an accounting start acknowledgement message comprising the subscriber and session identifiers to the RADIUS proxy. The RADIUS proxy transmits this accounting start acknowledge message comprising the subscriber and session identifiers to the NAS.

Naturally, the use of MSP points of presence by CSP subscribers must be evaluated so that the MSP may bill the CSP accordingly. At its simplest, the solution consists in billing the total connection time, independently of the number of simultaneous connections. However, MSPs generally prefer to bill CSPs according to the total connection time combined with the number of simultaneous connections. To that end, a predetermined number of connection thresholds are used as a billing basis. For example, using a single threshold θ, the connection time unit could be billed at price P₁ when the CSP number of connections is less than θ while the connection time unit could be billed at P₂ when the CSP number of connections is greater than θ. For sake of illustration, the following description is based upon the use of three thresholds θ₁, θ₂, and θ₃ (θ₁<θ₂<θ₃, θ₃ being the maximum number of allowed simultaneous connections). However, any number of thresholds may be used when using the method and systems of the invention.

FIG. 8 illustrates the general billing principle when using three thresholds θ₁, θ₂, and θ₃. As shown, when the number n of simultaneous connections is less than θ₁ (n<θ₁), the connection time is billed according to a first fee rating. When the number n of simultaneous connections is greater than θ1 and less than θ₂ (θ₁<n<θ₂), θ₂ connections are billed according to the first fee rating and (n−θ₁) are billed according to a second fee rating. When the number n of simultaneous connections is greater than θ₂ (θ₂<n<θ₃), θ₂ connections are billed according to the first fee rating, (θ₂−θ₂) are billed according to the second fee rating, and (n−θ₂) are billed according to a third fee rating.

FIG. 9, comprising tables a, b, and c, illustrates the general principle shown in FIG. 8. Table 9a depicts the establishment and duration of 13 connections, and table 9b illustrates the number of simultaneous connections. As shown, there is one connection at time 1, 3 connections at time 2, 4 connections at time 3 and so on. For sake of illustration, thresholds θ₁, θ₂, and θ₃ are set to 3, 5, and 7, respectively. Therefore, at time 1, the single connection is billed according to the first fee rating, at time 2, the 3 connections are also billed according to the first fee rating, at time 3, 3 connections are billed according to the first fee rating and one connection is billed according to the second fee rating and so on. Thus, at the end of the process illustrated by the 15 steps of FIG. 9 and considering regular time periods, the connection billing is determined by the sum of connections submitted to the first fee rating, the sum of connections submitted to the second fee rating, and the sum of connections submitted to the third fee rating. For example, the price P of the connections rent by the CSP could be: P=41*R ₁+17*R ₂+7*R ₃

-   -   wherein R₁, R₂, and R₃ are the cost per time period         corresponding to the first, second, and third fee rating,         respectively.

According to the invention, a connection table and a threshold table characterizing connections are dynamically updated in the MSP, each time a connection is established or stopped. FIG. 10 a shows an example of such a connection table 1000. As illustrated, each row corresponds to an active connection and for each active connection, the connection table stores the realm (or another CSP identifier) in column 1005, the start time in column 1010, and the billing level in column 1015. In this example, the connection table is common for all CSPs; however, a different connection table may be assigned to each CSP (or realm). In this last case, the column storing the realm is not required, but a linking table is needed to associate connection tables to realms. Figure 10 b depicts the threshold table 1020 that stores information relative to each CSP. Each row represents a different CSP (or realm). For each CSP, the CSP identifier, the thresholds, the elapsed connection times for each range of fee rating, and the number of active connections are stored in columns 1025, 1030, 1035, 1040, 1045, 1050, 1055, and 1060, respectively. Like the connection table 1000, the threshold table 1020 is common for all CSPs, but a different one may be assigned to each CSP (or realm). It is also to be noted that the number of thresholds and elapsed connection times associated with each CSP could be different for each of them.

FIG. 11 illustrates an example of the algorithm used for dynamically updating the connection and threshold tables in the MSP when a new connection is established, i.e., when an accounting start message is received. When an accounting start message concerning CSPj is received, a first step consists in setting a variable i to 1 (step 1105). Then, a first test is performed to determine if the number of active connections plus one is less than or equal to the threshold θi (step 1110). The number of active connections and the threshold θi may be read in the threshold table 1020. If the number of active connections plus one is greater than the threshold θi, variable i is incremented by one (step 1115). It is to be noted that it is not necessary to determine whether or not variable i has reached its maximum value since the number of active connections is less than the number of allowed connection (otherwise the connection request would have been rejected and no accounting start message would have been generated). If the number of active connections plus one is less than or equal to the threshold θi, a new entry is created in the connection table 1000 (step 1120). The created entry comprises the realm or another CSP identifier, the time at which connection has been established and the billing level that is determined by variable i, according to threshold θi. Then, the number of active connection that is stored in the threshold table 1020, is incremented by one (step 1125).

FIG. 12 shows the principle on which the computation of billing time is based. For sake of illustration, the description is based upon two connections but increasing this number does not change the principle. In this example, the first connection, referred to as connection_(—)1, starts at time t₁ ¹, before the second connection, referred to as connection_(—)2, is established at time t₂ ¹, and ends at time t₁ ² before the second one finishes at time t₂ ². Therefore the connection time T₁ of the first subscriber is T₁=t₁ ²−t₁ ¹ and the connection time T₂ of the second subscriber is T₂=t₂ ²−t₂ ¹. The total connection time is equal to T₁+T₂=(t₁ ²−t₁ ¹)+(t₂ ²−t₂ ¹) which may be expressed under the form T′₁+T′₂ wherein T′₁=t₂ ²−t₁ ¹ and T′₂=t₁ ²−t₂ ¹ since the addition is commutative. T′₁ and T′₂ may be analyzed as connection times corresponding to virtual connections referred to as connection′_(—)1 and connection′_(—)2 on FIG. 12. This latter form based on a virtual connection is preferable since it allows a direct evaluation of the connection cost when the connection established by the second subscriber is such that a connection threshold is exceeded when it is established. In such case, time T′₁ is billed according to a first fee rating while T′₂ is billed according to a second fee rating. When the connection established by the second subscriber is not such that a connection threshold is exceeded when it is established, the first form or the second one does not change billing results. Therefore the second form is used and, when a connection is stopped at a time t, the one that is associated with the higher fee rating in the connection table is selected and the corresponding start time is subtracted from the current time t, to be billed according to the corresponding higher fee rating. The connection row of the selected connection is removed from the connection table.

FIG. 13 illustrates an example of the algorithm used for dynamically updating the connection and threshold tables in the MSP when a connection is stopped, i.e., when an accounting stop message is received. When an accounting stop message concerning CSPj is received, a first step consists in setting a variable i to its maximum value, i.e., the number of threshold associated with the corresponding CSP, and a variable k to 1 (step 1300). Then, a first test is performed to determine whether or not the record stored in the k^(th) row of the connection table belongs to the same realm as the one associated with the received accounting stop message (step 1305). If the realms are not the same, variable k is incremented by one (step 1310) and the previous test (step 1305) is repeated. Else, if the realms are the same, a second test is done to determine whether or not the billing level BL(CSPj)_(k) stored in the k^(th) row of the connection table is equal to the billing level R_(i) associated with the range [θ_(i−1), θ_(i)], with θ₀=0, (step 1315). If billing levels are different, another test is performed to determine whether or not variable k has reached its maximum value i.e., the number of row of the connection table, (step 1320). If variable k has not reached its maximum value, variable k is incremented by one (step 1310). Else, if variable k has reached its maximum value, variable k is set to one and variable i is decremented by one (step 1325). Then the first test (step 1305) is repeated. If the billing levels are the same, the threshold table is updated (step 1330). To that end, the start time value stored in the k^(th) row of the connection table is subtracted from the current time and the resulting connection time is added to the one of the threshold table corresponding to the billing level of the k^(th) row of the connection table and to the associated realm. The number of active connections associated with the corresponding realm is decremented by one. Then, the k^(th) row of the connection table is removed (step 1335).

Therefore, billing the CSP consists in using the connection times stored in the threshold table and associated with the corresponding realm. These connection times are combined with the fee rating of each threshold range. When the connection times are used to bill the CSP, the threshold table is updated to reset corresponding connection times. Moreover, log records containing the start time and stop time, commonly referred to as Internet Protocol Data Records (IPDRs), may be generated e.g., for auditing purpose.

Naturally, it is at the CSP's discretion to accept or reject connection requests from subscribers, in particular when the number of simultaneous connections reaches a predetermined threshold. Such acceptation/rejection may depend, for example, upon subscriber's contract details.

The method and systems of the invention may be used in conjunction with telephone switch equipment supporting hunting features. Hunting features allow the automatic routing of calls directed to an initial group of lines, when all the lines of the this initial group are busy, to other line(s) in a predetermined group. Thus, when a subscriber of a Client SP initializes a call to a Client SP's POP, using a particular called-number, the call may be automatically transmitted to a Master SP's POP, having another call-in number, if the CSP's number is busy. In such case, the subscriber does not need to re-dial another call-in number and so, does not need to store all the numbers of the Master SPs renting access capacities to the subscriber's CSP.

Naturally, in order to satisfy local and specific requirements, a person skilled in the art may apply to the solution described above many modifications and alterations all of which, however, are included within the scope of protection of the invention as defined by the following claims. 

1. A method for determining a time period of sharing network access capacities between a Master Service Provider, comprising at least one Point Of Presence including at least one port, and a Client Service Provider, said time period of sharing network access capacities being determined according to at least one threshold representing a predetermined shared network access capacity amount and defining at least two ranges, a time period being associated with each of said ranges, said method comprising the steps of: initializing the time period associated with each of said ranges; and, when a port of said at least one Point Of Access of said Master Service Provider is used to establish a connection requested by a subscriber of said Client Service Provider, comparing a number of ports of said at least one Points Of Presence of said Master Service Provider used by subscribers of said Client Service Provider with said at least one threshold to determine the corresponding range and storing a time at which said connection is established in relation with said corresponding range; when one port of said at least one Points Of Presence of said Master Service Provider used by a subscriber of said Client Service Provider is released, determining a higher range to which a stored time is associated; selecting one of the times stored in relation with said determined range; subtracting said selected time to the time at which said port of said at least one Point Of Presence of said Master Service Provider is released; adding the result of said subtraction to the time period associated with said determined range; and, deleting said selected time.
 2. The method according to claim 1 wherein an identifier of the Client Service Provider is associated with said stored times and with said time periods.
 3. The method of claim 2 further comprising the step of comparing the Client Service Provider identifier of said subscriber having released a port with the identifier associated with the stored times and with the time periods so as to select a stored time and a time period sharing the same identifier as the Client Service Provider identifier of said subscriber having released a port.
 4. The method of claim 2 wherein said identifier is a realm of the Client Service Provider.
 5. The method according to claim 1 wherein a number of simultaneous connections established for subscribers of each Client Service Provider is stored and updated each time a connection is established or released.
 6. The method of claim 1 implemented in a RADIUS proxy, using a RADIUS protocol.
 7. An apparatus comprising means adapted for carrying out the method according to claim
 1. 8. A computer-like readable medium comprising instructions for carrying out the method according to claim
 1. 